/*-
 * Copyright 2012 Guram Dukashvili
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */
//---------------------------------------------------------------------------
#include "sys.h"
#include "cursor.h"
//---------------------------------------------------------------------------
struct cursor * cursor_new(void)
{
  struct cursor * c = salloc(sizeof(struct cursor),NULL);
  if( c != NULL )
    cursor_init(c);
  return c;
}
//---------------------------------------------------------------------------
void cursor_init(struct cursor * c)
{
  c->idx = NULL;
  index_btree_stack_init(&c->btree_stack);
}
//---------------------------------------------------------------------------
void cursor_delete(struct cursor * c)
{
  cursor_destroy(c);
  sfree(c);
}
//---------------------------------------------------------------------------
void cursor_destroy(struct cursor * c)
{
  index_btree_stack_destroy(&c->btree_stack);
}
//---------------------------------------------------------------------------
void cursor_insert_key(struct cursor * c,const void * key,const void * data)
{
  index_scatter(c->idx,&c->btree_stack,key,data);
}
//---------------------------------------------------------------------------
void cursor_update_key(struct cursor * c,const void * key,const void * data)
{
  index_update_key(c->idx,&c->btree_stack,key,data);
}
//---------------------------------------------------------------------------
void cursor_delete_key(struct cursor * c,const void * key,void * data)
{
  index_gather(c->idx,&c->btree_stack,key,data);
}
//---------------------------------------------------------------------------
void cursor_select_key(struct cursor * c,const void * key,void * data)
{
  index_lookup(c->idx,&c->btree_stack,key,data,NULL);
}
//---------------------------------------------------------------------------
